Online Multiple Palindrome Pattern Matching
نویسندگان
چکیده
A palindrome is a string that reads the same forward and backward. We say that two strings of the same length are pal-equivalent if for each possible center they have the same length of the maximal palindrome. Given a text T of length n and a set of patterns P1, . . . , Pk, we study the online multiple palindrome pattern matching problem that finds all pairs of an index i and a pattern Pj such that T [i−|Pj |+1 : i] and Pj are pal-equivalent. We solve the problem in O(mkM) preprocessing time and O(mkn) query time using O(mkM) space, where M is the sum of all pattern lengths and mk is the longest pattern length.
منابع مشابه
OMPPM: online multiple palindrome pattern matching
MOTIVATION A palindrome is a string that reads the same forward and backward. Finding palindromic substructures is important in DNA, RNA or protein sequence analysis. We say that two strings of the same length are pal-equivalent if, for each possible centre, they have the same length of the maximal palindrome. Given a text T of length n and a pattern P of length m, we study the palindrome patte...
متن کاملPalindrome Pattern Matching
A palindrome is a string that reads the same forward and backward. For a string x, let Pals(x) be the set of all maximal palindromes of x, where each maximal palindrome in Pals(x) is encoded by a pair (c, r) of its center c and its radius r. Given a text t of length n and a pattern p of length m, the palindrome pattern matching problem is to compute all positions i of t such that Pals(p) = Pals...
متن کاملOnline Dictionary Matching for Streams of XML Documents
We consider the online multiple-pattern matching problem for streams of XML documents, when the patterns are expressed as linear XPath expressions containing child operators (/), descendant operators (//) and wildcards (∗) but no predicates. For each document in the stream, the task is to determine all occurrences in the document of all the patterns. We present a general multiple-pattern-matchi...
متن کاملMultiple serial episode matching
In [BCGM01] we have generalized the Knuth-Morris-Pratt (KMP) pattern matching algorithm and defined a nonconventional kind of RAM, the MP–RAMs which model more closely the microprocessor operations, and designed an O(n) on-line algorithm for solving the serial episode matching problem on MP–RAMs when there is only one single episode. We here give two extensions of this algorithm to the case whe...
متن کاملEfficient Online Timed Pattern Matching by Automata-Based Skipping
The timed pattern matching problem is an actively studied topic because of its relevance in monitoring of real-time systems. There one is given a log w and a specificationA (given by a timed word and a timed automaton in this paper), and one wishes to return the set of intervals for which the log w, when restricted to the interval, satisfies the specificationA. In our previous work we presented...
متن کامل